Bayesian Structure Learning in Sparse Gaussian Graphical Models
نویسندگان
چکیده
منابع مشابه
Bayesian Learning of Sparse Gaussian Graphical Models
Sparse inverse covariance matrix modeling is an important tool for learning relationships among different variables in a Gaussian graph. Most existing algorithms are based on `1 regularization, with the regularization parameters tuned via cross-validation. In this paper, a Bayesian formulation of the problem is proposed, where the regularization parameters are inferred adaptively and cross-vali...
متن کاملBayesian model selection in sparse Gaussian graphical models
Decoding complex relationships among large numbers of variables with relatively small data sets is one of the crucial issues in science. One approach to those problems is Gaussian graphical modeling, which describes conditional independence of variables through the presence or absence of edges in the underlying graph. In this paper, we introduce a novel Bayesian framework for Gaussian graphical...
متن کاملBayesian structure learning in graphical models
We consider the problem of estimating a sparse precision matrix of a multivariate Gaussian distribution, including the case where the dimension p exceeds the sample size n. Gaussian graphical models provide an important tool in describing conditional independence through presence or absence of the edges in the underlying graph. A popular non-Bayesian method of estimating a graphical structure i...
متن کاملBayesian structural learning and estimation in Gaussian graphical models
We propose a new stochastic search algorithm for Gaussian graphical models called the mode oriented stochastic search. Our algorithm relies on the existence of a method to accurately and efficiently approximate the marginal likelihood associated with a graphical model when it cannot be computed in closed form. To this end, we develop a new Laplace approximation method to the normalizing constan...
متن کاملBayesian Learning in Sparse Graphical Factor Models via Annealed Entropy
We describe a class of sparse latent factor models, called graphical factor models (GFMs), and relevant sparse learning algorithms for posterior mode estimation. Linear, Gaussian GFMs have sparse, orthogonal factor loadings matrices, that, in addition to sparsity of the implied covariance matrices, also induce conditional independence structures via zeros in the implied precision matrices. We d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bayesian Analysis
سال: 2015
ISSN: 1936-0975
DOI: 10.1214/14-ba889